Minimal linear codes over finite fields

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Linear Codes over Finite Fields

As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that wmin/wmax > (q− 1)/q is a sufficient condition for a linear code over the finite field ...

متن کامل

Linear covering codes over nonbinary finite fields

For a prime power q and for integers R, η with R > 0, 0 ≤ η ≤ R − 1, let A R,q = (Cni)i denote an infinite sequence of q-ary linear [ni, ni − ri]qR codes Cni with covering radius R and such that the following two properties hold: (a) the codimension ri = Rti + η, where (ti)i is an increasing sequence of integers; (b) the length ni of Ci coincides with f (η) q (ri), where f (η) q is an increasin...

متن کامل

Complementary Dual Subfield Linear Codes Over Finite Fields

Two families of complementary codes over finite fields q are studied, where 2 = q r is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and sufficient conditions for a linear code (resp., a subfield linear code) to be Hermitian complementary dual (resp., trace Hermitian complementary dual) are determined. Construct...

متن کامل

Constacyclic codes over finite fields

An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length lp are characterized, where p is the characteristic of the finite field and l is a prime different from p.

متن کامل

Linear Codes over Finite Rings

Linear codes over finite rings with identity have recently raised a great interest for their new role in algebraic coding theory and for their successful application in combined coding and modulation. Thus, in this paper we address the problems of constructing of new cyclic, BCH, alternant, Goppa and Srivastava codes over local finite commutative rings with identity. These constructions are ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2018

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2018.08.010